2-Size Resolvability in Graphs
نویسندگان
چکیده
A vertex u in a graph G resolves a pair of distinct vertices x, y of G if the distance between u and x is different from the distance between u and y. A set W of vertices in G resolves the graph G if every pair of distinct vertices of G is resolved by some vertices in W . The metric dimension of a graph, denoted by dim(G), is the smallest cardinality of a resolving set. A resolving set W for a connected graph G of order n ≥ 3 is called 2-size resolving set if the size of the subgraph < W > induced by W is two. The minimum cardinality of a 2-size resolving set is called the 2-size metric dimension of G, denoted by tr(G). A 2-size resolving set of cardinality tr(G) is called a tr-set. In this paper, we study 2-size resolving sets in some well-known classes of graphs and give some realizable results.
منابع مشابه
On the Partition Dimension of Cartesian Product Graphs
Let G = (V, E) be a connected graph. The distance between two vertices u, v 2 V, denoted by d(u, v), is the length of a shortest u À v path in G. The distance between a vertex v 2 V and a pd(G), is the minimum number of sets in any resolving partition of G. In this article we study the partition dimension of Cartesian product graphs. More precisely, we show that for all pairs of connected graph...
متن کاملCondition Graphs
A connection graph represents resolvability in a set of clauses explicitly. The corresponding connection graph proof procedure has the deeciency that the graphs may grow, becoming impractical to handle. We present a novel proof procedure for condition graphs, which is a reenement of connection graphs. Our idea is to control the growth of the graph by recognizing tests in clauses and translating...
متن کاملOn an Algorithm for a Double-resolvability Test
To find all doubly resolvable designs with definite parameters, we construct the design resolutions in lexicographic order point by point. To partial solutions with more than 2/3 of the points we apply a double-resolvability test, namely we try to construct an orthogonal resolution. The test reduces significantly the number of partial solutions, and is very important for the efficiency of the w...
متن کاملVariable-Length Resolvability for General Sources and Channels
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated. We first analyze the variable-length resolvability with the variational d...
متن کاملSecrecy from Resolvability
We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...
متن کامل